A HYBRID METAHEURISTIC NAVIGATION ALGORITHM FOR ROBOT PATH ROLLING PLANNING IN AN UNKNOWN ENVIRONMENT
نویسندگان
چکیده
منابع مشابه
A Navigation System for Autonomous Robot Operating in Unknown and Dynamic Environment: Escaping Algorithm
In this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. It is assumed that the robot performs navigation in...
متن کاملa navigation system for autonomous robot operating in unknown and dynamic environment: escaping algorithm
in this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. it is assumed that the robot performs navigation in unknown environment and builds the map through slam procedure. since the moving objects' location and properties are unknown, they are identified and tracked by kalman filter. kalm...
متن کاملA New Hybrid Method for Mobile Robot Dynamic Local Path Planning in Unknown Environment
In this paper, a hybrid approach for efficiently planning smooth local paths for mobile robot in an unknown environment is presented. The single robot is treated as a multi-agent system, and the corresponding architecture with cooperative control is constructed. And then a new method of information fusion namely DSmT (Dezert-Smarandache Theory) which is an extension of the DST (Dempster-Shafer ...
متن کاملAn effective hybrid algorithm for mobile robot global path planning
Ant Colony Optimization (ACO) exhibits parallelism, contains certain redundancy and historical information of the past solutions with pheromone trail, and is suitable for implementation on massively parallel architecture. But it is not easy to avoid local optima, especially for large-scale schedule problems. Simulated annealing (SA) is a naturally serial algorithm, but its behavior can be contr...
متن کاملAn Integrated Algorithm for Autonomous Navigation of a Mobile Robot in an Unknown Environment
Global path planning algorithms are good in planning an optimal path in a known environment, but would fail in an unknown environment and when reacting to dynamic and unforeseen obstacles. Conversely, local navigation algorithms perform well in reacting to dynamic and unforeseen obstacles but are susceptible to local minima failures. A hybrid integration of both the global path planning and loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mechatronic Systems and Control
سال: 2019
ISSN: 2561-178X
DOI: 10.2316/j.2019.201-3000